Performance guarantee for edf under overload
نویسندگان
چکیده
منابع مشابه
Performance guarantee for EDF under overload
Earliest deadline first (edf) is a widely used algorithm for online deadline scheduling. It has been known for long that edf is optimal for scheduling an underloaded, single-processor system; recent results on the extra-resource analysis of edf further revealed that edf when using moderately faster processors can achieve optimal performance in the underloaded, multi-processor setting. This pape...
متن کاملHigh Utilization Guarantee for Hierarchical Diff-EDF Schedulers
Packet networks are currently enabling the integration of traffic with a wide range of characteristics that extend from video traffic with stringent QoS requirements to the best-effort traffic requiring no guarantees. QoS guarantees can be provided in conventional packet networks by the use of proper packet scheduling algorithms. As a computer revolution, many scheduling algorithms have been pr...
متن کاملSustaining Performance Under Traffic Overload
In this paper, we investigate the performance of wireless ad hoc networks with traffic loads beyond saturation. While it is desirable to operate a network below saturation, an ad hoc network should be designed to degrade its performance gracefully under severe loads. Using AODV (ad hoc on-demand distance vector) and 802.11 as example routing and MAC (Medium Access Control) level protocols, we s...
متن کاملMaintaining End-system Performance under Network Overload
Network performance is currently outpacing the performance improvements seen by host systems, leading to a significant performance gap between the throughput which may be supported by a network interface, and the actual throughput which can be achieved by a typical end-system. Because this is the case, end-systems must be able to cope with applied loads which exceed their capacities. In particu...
متن کاملProbabilistic Performance Guarantee for Real - Time Tasks
This paper describes how the scheduling algorithms and schedulability analysis methods developed for periodic tasks can be extended to provide performance guarantees to semi-periodic tasks. Like periodic tasks, the requests in a semi-periodic task are released regularly. However, their computation times vary widely. We focus on systems where the total maximum utilization of the tasks on each pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algorithms
سال: 2004
ISSN: 0196-6774
DOI: 10.1016/j.jalgor.2003.10.004